The Number of Homomorphisms from Metacyclic Group to Modular Group

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generating Function of the Number of Homomorphisms from a Surface Group into a Finite Group

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate the number of homomorphisms using the decomposition of the group algebra into irreducible factors. This gives a new proof of the classical formulas of Frobe...

متن کامل

The Dade group of a metacyclic p-group

The Dade group D(P ) of a finite p-group P , formed by equivalence classes of endopermutation modules, is a finitely generated abelian group. Its torsion-free rank equals the number of conjugacy classes of non-cyclic subgroups of P and it is conjectured that every nontrivial element of its torsion subgroup D(P ) has order 2, (or also 4, in case p = 2). The group D(P ) is closely related to the ...

متن کامل

from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar

chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...

15 صفحه اول

Computing with Group Homomorphisms

Let G = (X) and H be finite groups and let r : X ~ H be a map from the generating set X of G into H. We describe a simple approach for deciding whether or not r determines a group homomorphism from G to H, and if it does, for computing the kernel of r If O and H are permutation groups the algorithm is a simple application of standard algorithms for bases and strong generating sets. If G and H a...

متن کامل

Group Homomorphisms and Isomorphisms

c W W L Chen, 1991, 1993, 2013. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage and retrieval system without permission from the author, unless such system is not accessible t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DEStech Transactions on Engineering and Technology Research

سال: 2018

ISSN: 2475-885X

DOI: 10.12783/dtetr/pmsms2018/24887